Improved LC-trie for Efficient IP Address Lookup
نویسندگان
چکیده
منابع مشابه
Improving and Analyzing LC-Trie Performance for IP-Address Lookup
IP-address lookup is a key processing function of Internet routers. The lookup is challenging because it needs to perform a longest prefix match. In this paper, we present our modifications to an efficient lookup algorithm, the LC-trie, based on a technique called prefix transformation. Thereafter, the LC-trie’s performance is analyzed for both the original and our modified algorithm using real...
متن کاملModified LC-Trie Based Efficient Routing Lookup
IP address lookup at the router is a complex problem. This has been primarily due to the increasing table sizes, growth in traffic rate and high link capacities. In this work we have proposed an algorithm for fast routing lookup with reduced memory utilization and access time. This approach shows significant performance improvement in the average case and optimizes the overall time taken for pa...
متن کاملIP-address lookup using LC-tries
There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...
متن کاملIP Lookup Table Design using LC-trie with Memory Constraint
IP address lookup is to determine the next hop destination o f an incoming packet in the router. The address lookup is a major bottleneck in high performance router due to the increased routing table sizes, increased traffic, higher speed links, and the migration to 128 bits IPv6 addresses. IP lookup time is dependent on data structure of lookup table and search scheme. In this paper, we propos...
متن کاملTree-Combined Trie: A Compressed Data Structure for Fast Ip Address Lookup
For meeting the requirements of the high-speed Internet and satisfying the Internet users, building fast routers with high-speed IP address lookup engine is inevitable. Regarding the unpredictable variations occurred in the forwarding information during the time and space, the IP lookup algorithm should be able to customize itself with temporal and spatial conditions. This paper proposes a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2007
ISSN: 1598-4877
DOI: 10.5392/jkca.2007.7.3.050